Filtered Belief Revision: Syntax and Semantics
نویسندگان
چکیده
Abstract In an earlier paper [Rational choice and AGM belief revision, Artificial Intelligence , 2009] a correspondence was established between the set-theoretic structures of revealed-preference theory (developed in economics) syntactic revision functions philosophy computer science). this we extend re-interpretation those terms one-shot by relating them to trichotomous attitude towards information studied Garapa (Rev Symb Logic, 1–21, 2020) where may be either (1) fully accepted or (2) rejected (3) taken seriously but not accepted. We begin introducing notion filtered providing characterization it mixture both contraction. then establish proposed above-mentioned structures, interpreted as semantic partial structures. also provide interpretation degree implausibility information.
منابع مشابه
Distance Semantics for Belief Revision
1 I n t r o d u c t i o n Intelligent agents must gather information about the world, elaborate theories about it and revise those theories in view of new information that , sometimes, contradicts the beliefs previously held. Belief revision is therefore a central topic in Knowledge Representation. It has been studied in different forms: numeric or symbolic, procedural or declarative, logical o...
متن کاملStrong Syntax Splitting for Iterated Belief Revision
AGM theory is the most influential formal account of belief revision. Nevertheless, there are some issues with the original proposal. In particular, Parikh has pointed out that completely irrelevant information may be affected in AGM revision. To remedy this, he proposed an additional axiom (P) aiming to capture (ir)relevance by a notion of syntax splitting. In this paper we generalize syntax s...
متن کاملMutual Belief Revision: Semantics and Computation
This paper presents both a semantic and a computational model for multi-agent belief revision. We show that these two models are equivalent but serve different purposes. The semantic model displays the intuition and construction of the belief revision operation in multi-agent environments, especially in case of just two agents. The logical properties of this model provide strong justifications ...
متن کاملOn The Semantics of Belief Revision Systems
We consider belief revision operators that satisfy the Alchourrr on-GG ardenfors-Makinson postulates, and present an epistemic logic in which, for any such revision operator, the result of a revision can be described by a sentence in the logic. In our logic, the fact that the agent's set of beliefs is is represented by the sentence O, where O is Levesque's `only know' operator. Intuitively, O i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2022
ISSN: ['1572-9583', '0925-8531']
DOI: https://doi.org/10.1007/s10849-022-09374-x